Spanning trees homeomorphic to a small tree
نویسندگان
چکیده
منابع مشابه
Spanning Trees of Small Degree
In this paper we show that pseudo-random graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)-graphs with sufficiently large spectral gap contain such spanning trees.
متن کاملDominator Tree Certification and Independent Spanning Trees
How does one verify that the output of a complicated program is correct? One can formally prove that the program is correct, but this may be beyond the power of existing methods. Alternatively one can check that the output produced for a particular input satisfies the desired input-output relation, by running a checker on the input-output pair. Then one only needs to prove the correctness of th...
متن کاملHomeomorphic alignment of weighted trees
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape to a pre-specified tree model. Unfortunately, the tree representation can contain vertices that split limbs in multiple parts, which do not allow a good match by usual methods. To solve this problem, we propose a new al...
متن کاملFigure 12.2: A Spanning Tree Produced by an On-Line Small Spanning Tree Algorithm
In all of the previous chapters, algorithms are designed under the assumption that the whole picture of the data are available for us before the algorithm is executed. That is, problems are solved together with complete information of the data. However, this is not necessarily true in reality. Consider the disk scheduling problem. The requests of disk servers are totally unknown to the algorith...
متن کاملIndependent Spanning Trees with Small Stretch
A pair of spanning trees rooted at a vertex r are independent if for every vertex v the pair of unique tree paths from v to the root r are disjoint. This paper presents the rst analysis of the path lengths involved in independent spanning trees in 2-edge-connected and 2-vertex-connected graphs. We present upper and lower bounds on the stretch factors of pairs of independent spanning trees, wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.10.004